Principal type schemes for functional programs with overloading and subtyping
نویسندگان
چکیده
منابع مشابه
Principal Type Schemes for Functional Programs with Overloading and Subtyping
We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping. Our approach is to attach constraints to quantified types in order to restrict the allowed instantiations of type variables. We present an algorithm for inferring principal types and prove its soundness and completeness. We find that it is necessary in practice to simplify the inferr...
متن کاملPrincipal Type Schemes for Modular Programs
Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these features have been studied extensively, their interaction has never received a proper type-theoretic treatment. One consequence is that both the official Definition and the alternative Harper-Stone semantics of Standard ML are di...
متن کاملDependent Types with Subtyping and Late-Bound Overloading
We present a calculus with dependent types, subtyping and late-bound overloading. Besides its theoretical interest this work is motivated by several practical needs that range from the definition of logic encodings, to proof specialization and reuse, and to object-oriented extension of the SML module system. The theoretical study of this calculus is not straightforward. While confluence is rela...
متن کاملPrincipal Type-Schemes and Condensed Detachment
and introduction. The condensed detachment rule, or rule D, was first proposed by Carew Meredith in the 1950's for propositional logic based on implication. It is a combination of modus ponens with a "minimal" amount of substitution. We shall give a precise detailed statement of rule D. (Some attempts in the published literature to do this have been inaccurate.) The D-completeness question for ...
متن کاملPrincipal Type Schemes for the Strict Type Assignment System
We study the strict type assignment system, a restriction of the intersection type discipline [6], and prove that it has the principal type property. We define, for a term M, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for M can be obtained from the principal one by these operations, and that these map deducible pairs to deduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1994
ISSN: 0167-6423
DOI: 10.1016/0167-6423(94)00020-4